Simultaneous Removal of Prefix and Suffix

Bounded Prefix-Suffix Duplication

Abs t r ac t . We consider a restricted variant of the prefix-sufñx duplication operation, called bounded prefix-sufñx duplication. It consists in the iterative duplication of a prefix or suffix, whose length is bounded by a constant, of a given word. We give a sufncient condition for the closure under bounded prefix-sufñx duplication of a class of languages. Consequently, the class of regular ...

Prefix-suffix duplication

Prefix-Shuffled Geometric Suffix Tree

Protein structure analysis is one of the most important research issues in the post-genomic era, and faster and more accurate index data structures for such 3-D structures are highly desired for research on proteins. The geometric suffix tree is a very sophisticated index structure that enables fast and accurate search on protein 3-D structures. By using it, we can search from 3-D structure dat...

Optimal prefix and suffix queries on texts

In this paper, we study a restricted version of the position restricted pattern matching problem introduced and studied Mäkinen and Navarro [Position-Restricted Substring Searching, LATIN 2006]. In the problem handled in this paper, we are interested in those occurrences of the pattern that lies in a suffix or in a prefix of the given text. We achieve optimal query time for our problem against ...

Approximate All-Pairs Suffix/Prefix Overlaps

Finding approximate overlaps is the first phase of many sequence assembly methods. Given a set of r strings of total length n and an error-rate , the goal is to find, for all-pairs of strings, their suffix/prefix matches (overlaps) that are within edit distance k = d `e, where ` is the length of the overlap. We propose new solutions for this problem based on backward backtracking (Lam et al. 20...